Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time (Extended Abstract) Amir M. Ben-Amram1, , Neil D. Jones2 , and Lars Kristiansen3 1

Source URL: www2.mta.ac.il

February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass

Source URL: www.cs.cornell.edu

• Computational complexity theory
• Complexity classes
• Theory of computation
• Polynomial hierarchy
• P versus NP problem
• IP
• True quantified Boolean formula
• NP
• PP
• Oracle machine
• PSPACE-complete
• Polynomial-time reduction

On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh

Source URL: www.complexity.ethz.ch

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Automated theorem proving
• Logic in computer science
• Rules of inference
• Resolution
• Proof complexity
• Conflict-Driven Clause Learning
• Boolean algebra
• Exponential time hypothesis
• PP

Almost Optimal Exploration in Multi-Armed Bandits Zohar Karnin Yahoo! Labs, Haifa, Israel Tomer Koren† Technion—Israel Institute of Technology, Haifa, Israel

Source URL: jmlr.org

• Mathematics
• Computational complexity theory
• Mathematical analysis
• Machine learning
• Multi-armed bandit
• Stochastic optimization
• Algorithm
• Exponential time hypothesis
• Big O notation

3 Scientific Information 3.1

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Analysis of algorithms
• Online algorithms
• Computer science
• Theory of computation
• Competitive analysis
• List update problem
• Adversary model
• Algorithm
• Randomized algorithm
• Travelling salesman problem
• Time complexity

Chapter 1 Time complexity Use of time complexity makes it easy to estimate the running time of a program. Performing an accurate calculation of a program’s operation time is a very labour-intensive process (it depends

Source URL: codility.com

Communication Optimal Parallel Multiplication of Sparse Random Matrices∗ Grey Ballard Aydın Buluç

Source URL: gauss.cs.ucsb.edu

• Multiplication
• Matrix theory
• Numerical linear algebra
• Matrix multiplication algorithm
• Analysis of algorithms
• Computational complexity theory
• Matrix multiplication
• Matrix
• Parallel computing
• Multiplication algorithm
• Algorithm
• Time complexity

SIAM J. COMPUT. Vol. 43, No. 1, pp. 312–336 c 2014 Society for Industrial and Applied Mathematics 

Source URL: theory.stanford.edu

• Computational complexity theory
• Operations research
• Complexity classes
• Polynomial-time approximation scheme
• Mechanism design
• Optimization problem
• Approximation algorithm
• Time complexity
• Mathematical optimization
• Exact algorithm
• Single-parameter utility
• Perturbation theory

PDF Document

Source URL: www.math.stevens.edu

• Theory of computation
• Computational complexity theory
• Theoretical computer science
• Computability theory
• Analysis of algorithms
• Complexity classes
• Generic-case complexity
• Halting problem
• Time complexity
• Algorithm
• NP
• Randomized algorithm

PDF Document

Source URL: ceng.usc.edu

• Combinatorial optimization
• Hungarian algorithm
• Matching
• Time complexity
• Dynamic programming